The Volumetric Barrier for Semide nite Programming
نویسنده
چکیده
We consider the volumetric barrier for semideenite programming, or \generalized" volumetric barrier, as introduced by Nesterov and Nemirovskii. We extend several fundamental properties of the volumetric barrier for a polyhedral set to the semideenite case. Our analysis facilitates a simpliied proof of self-concordancy for the semideenite volu-metric barrier, as well as for the combined volumetric-logarithmic barrier for semideenite programming. For both of these barriers we obtain self-concordancy parameters equal to those previously shown to hold in the polyhedral case.
منابع مشابه
Symmetric primal dual path following algorithms for semide nite programming
We propose a framework for developing and analyzing primal dual interior point algorithms for semide nite programming This framework is an extension of the v space approach that was de veloped by Kojima et al for linear complementarity problems The extension to semide nite programming allows us to interpret Nesterov Todd type directions as Newton search direc tions Our approach does not involve...
متن کاملInterior-Point Methods
The modern era of interior-point methods dates to 1984, when Karmarkar proposed his algorithm for linear programming. In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such as convex quadratic programming, semide nite programming, and nonconvex and nonlinear problems, have reached varyin...
متن کاملSemideenite Programming
In semide nite programming one minimizes a linear function subject to the constraint that an a ne combination of symmetric matrices is positive semide nite. Such a constraint is nonlinear and nonsmooth, but convex, so semide nite programs are convex optimization problems. Semide nite programming uni es several standard problems (e.g., linear and quadratic programming) and nds many applications ...
متن کاملPolynomial Primal Dual Cone Affine Scaling for Semidefinite Programming
Semide nite programming concerns the problem of optimizing a linear function over a section of the cone of semide nite matrices In the cone a ne scaling approach we replace the cone of semide nite matrices by a certain inscribed cone in such a way that the resulting optimization problem is analytically solvable The now easily obtained solution to this modi ed problem serves as an approximate so...
متن کاملOn the long step path following method for semide nite pro gramming
It has been shown in various recent research reports that the analysis of short step primal dual path following algorithms for linear programming can be nicely generalized to semide nite programming How ever the analysis of long step path following algorithms for semide nite programming appeared to be less straightforward For such an algorithm Monteiro obtained an O n log iteration bound for ob...
متن کامل